Transformation of BL-general Fuzzy Automata

Authors

A. Saeidi Rashkolia Department of Mathematics, Islamic Azad University, Kerman Branch, Kerman, Iran

M. Shamsizadeh Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran

Abstract:

In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are less than the minimal quotient BL-GFA.

Upgrade to premium to download articles

Already have an account?login

similar resources

Reduction of BL-general L-fuzzy Automata

In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...

full text

Bisimulation for BL-general fuzzy automata

In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...

full text

I-homomorphism for BL-I-General L-fuzzy Automata

Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...

full text

general complex fuzzy transformation semigroups in automata

in this paper, we define the concepts of a complex fuzzy subset and a complex fuzzy finite state automaton. then we extend the notion of a complex fuzzy finite state automaton and introduce the notion of a general complex fuzzy automaton. after that we define the concept of a max- min general complex fuzzy automaton and construct some equivalence relations and some congruence relations in a max...

full text

Bipolar general fuzzy automata

In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.

full text

ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON

In this note, we define the concepts of admissible relation and admissible partition for an arbitrary BL-general fuzzy automaton.In particular, a connection between the admissible partition and the quotient BL-general fuzzy automaton is presented.It is shown that if we use the maximal admissible partition, then we obtain a quotient BL-general fuzzy automaton and this quotient is minimal. Finall...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}

Journal title

International Journal of Industrial Mathematics

volume 11 issue 3

pages 177- 187

publication date 2019-08-01

unfollow

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Homomorphism Strong homomorphism BL-general fuzzy automata Quotient BL-general fuzzy automata Transformation of BL-general fuzzy automata

Hosted on Doprax cloud platform doprax.com